Deciding detectability for labeled Petri nets
نویسندگان
چکیده
منابع مشابه
Deciding Detectability for Labeled Petri Nets
Detectability of discrete event systems (DESs) is a property to determine a priori whether the current and subsequent states can be determined based on observations. In this paper, we investigate the verification of two detectability properties – strong detectability and weak detectability – for DESs modeled by labeled Petri nets. Strong detectability requires that we can always determine, afte...
متن کاملOn detectability of labeled Petri nets with inhibitor arcs
Detectability is a basic property of dynamic systems: when it holds one can use the observed output signal produced by a system to reconstruct its current state. In this paper, we consider properties of this type in the framework of discrete event systems modeled by Petri nets (a.k.a. place/transition nets). We first study weak detectability and weak approximate detectability. The former implie...
متن کاملDeciding Structural Liveness of Petri Nets
Place/transition Petri nets are a standard model for a class of distributed systems whose reachability spaces might be infinite. One of well-studied topics is the verification of safety and liveness properties in this model; despite the extensive research effort, some basic problems remain open, which is exemplified by the open complexity status of the reachability problem. The liveness problem...
متن کاملDeciding Life-Cycle Inheritance on Petri Nets
One of the key issues of object-oriented modeling is inheritance. It allows for the definition of a subclass that inherits features from some superclass. When considering the dynamic behavior of objects, as captured by their life cycles, there is no general agreement on the meaning of inheritance. Basten and Van der Aalst introduced the notion of life-cycle inheritance for this purpose. Unfortu...
متن کاملAutomated Abstraction of Labeled Petri Nets
Due to the increasing use and complexity of embedded and cyber-physical systems, proper validation of these systems is an increasingly important topic. Because these systems are used in safety-critical situations, even intermittent failures are unacceptable. Formal verification allows for comprehensive validation, but becomes unrealistically complicated for large models. This paper proposes cer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automatica
سال: 2019
ISSN: 0005-1098
DOI: 10.1016/j.automatica.2019.02.058